On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families

نویسندگان

  • Alireza Tasdighi
  • Mohammad-Reza Sadeghi
چکیده

A simple and general definition of quasi cyclic low-density parity-check (QC-LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple-edge protograph codes. The code construction is mainly based on perfect difference families (PDF’s) and is called Construction 1. Secondly, using the proposed Construction 1 along with a technique named as column dispersion technique (CDT), we design several types of multiple-edge CPM-QC-LDPC codes (codes with Construction 2) in a wide range of rates, lengths, girths and minimum distances. Parameters of some of these codes are reported in tables. Also included in this paper are the multiplicities of short simple cycles of length up to 10 in Tanner graph of our constructed codes. Our experimental results for short to moderate length codes show that although minimum distances of codes play an important role in waterfall region, the higher the number of short simple cycles is, the better (sharper) the waterfall is. The performances of many codes such as WiMAX, PEG, array, MacKay, algebraic and combinatorial, and also, symmetrical codes have compared with our constructed codes. Based on our numerical results and regardless of how a code is constructed, those with higher number of short simple cycles and higher minimum distances, have better waterfalls. As, high number of short simple cycles cause error floor phenomenon, we show that our constructed codes based on applying CDT on PDF’s have a property that we can gradually increase their number of short simple cycles to outperform many of the codes in the literature whilst, preventing them to have very high number of short cycles and thus avoiding undesirable error floors. A. Tasdighi and M. R. Sadeghi are with the Department of Mathematics & Computer Science, Amirkabir University of Technology, Tehran, Iran (e-mails: [email protected], [email protected]) 2 Index Terms QC-LDPC codes, QC-LDPC code construction, Perfect difference families, Girth, Minimum distance, Inevitable cycle, Error floor

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

On the Usage of LDPC Codes in the McEliece Cryptosystem

In this paper, a new variant of the McEliece cryptosystem, based on Low-Density Parity-Check (LDPC) codes, is studied. Random-based techniques allow to design large families of LDPC codes with equivalent error correction capability; therefore, in principle, such codes can substitute Goppa codes, originally used by McEliece in his cryptosystem. Furthermore, Quasi-Cyclic (QC) LDPC codes can be ad...

متن کامل

LDPC Codes in the McEliece Cryptosystem

The original McEliece cryptosystem, based on Goppa codes, has two important drawbacks: long keys and low transmission rate. LDPC codes seem natural candidates to overcome such drawbacks, because of their sparse parity-check matrices, that could form the public keys, and the flexibility in transmission rates. Moreover, quasi-cyclic (QC) LDPC codes could permit to further reduce the key length. S...

متن کامل

Lower bounds on the lifting degree of single-edge and multiple-edge QC-LDPC codes by difference matrices

In this paper, we define two matrices named as “difference matrices”, denoted by D and DD which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge (m,n)-regular QC-LDPC code...

متن کامل

Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve

For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.06218  شماره 

صفحات  -

تاریخ انتشار 2017